Density-matrix renormalization group algorithms
نویسندگان
چکیده
The Density Matrix Renormalization Group (DMRG) was developed by White [1, 2] in 1992 to overcome the problems arising in the application of real-space renormalization groups to quantum lattice many-body systems in solid-state physics. Since then the approach has been extended to a great variety of problems in all fields of physics and even in quantum chemistry. The numerous applications of DMRG are summarized in two recent review articles [3, 4]. Additional information about DMRG can be found at http://www.dmrg.info. Originally, DMRG has been considered as an extension of real-space renor-malization group methods. The key idea of DMRG is to renormalize a system using the information provided by a reduced density matrix rather than an effective Hamiltonian (as done in most renormalization groups), hence the name density-matrix renormalization. Recently, the connection between DMRG and matrix-product states has been emphasized (for a recent review, see [5]) and has lead to significant extensions of the DMRG approach. From this point of view, DMRG is an algorithm for optimizing a variational wavefunction with the structure of a matrix-product state. In this chapter I will introduce the basic DMRG algorithms for calculating ground states in quantum lattice many-body systems using the one-dimensional spin-1 2 Heisenberg model as illustration. I will attempt to present these methods in a manner which combines the advantages of both the traditional formulation in terms of renormalized blocks and superblocks and the new description based on matrix-product states. The latter description is physically more intuitive but the former description is more appropriate for writing an actual DMRG program. Pedagogical introductions to DMRG which closely follow the original formulation are available in refs. [6, 7]. The conceptual background of DMRG and matrix-product states is discussed in the previous chapter [8] and should be read before this chapter. Extensions of the basic DMRG algorithms are presented in the following chapters [9, 10, 11]. The outline of this chapter is as follows: First I briefly introduce the DMRG matrix-product state and examine its relation to the traditional DMRG blocks and superblocks in section 1. In the next three sections I present a numerical
منابع مشابه
Density Matrix Renormalization Group for Dummies
We describe the Density Matrix Renormalization Group algorithms for time dependent and time independent Hamiltonians. This paper is a brief but comprehensive introduction to the subject for anyone willing to enter in the field or write the program source code from scratch. An open source version of the code can be found at: http://qti.sns.it/dmrg/phome.html .
متن کاملSe p 19 95 Corner Transfer Matrix Renormalization Group Method
We propose a new fast numerical renormalization group method, the corner transfer matrix renormalization group (CTMRG) method, which is based on a unified scheme of Baxter's corner transfer matrix method and White's density matrix renormalization group method. The key point is that a product of four corner transfer matrices coincides with the density matrix. We formulate the CTMRG method as a r...
متن کاملVariational optimization algorithms for uniform matrix product states
We combine the Density Matrix Renormalization Group (DMRG) with Matrix Product State tangent space concepts to construct a variational algorithm for finding ground states of one dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform Matrix Product State algorithm (VUMPS) with infinite Density Matrix Renormalization Group (IDMRG) and with infini...
متن کاملMatrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms.
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In t...
متن کاملTime-Dependent Real-Space Renormalization Group Method
In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007